Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields
نویسندگان
چکیده
Abstract In recent years, operations research in agriculture has improved the harvested yield, reduced cost and time required for field operations, maintained economic environmental sustainability. The heuristics method, named Evolutionary neighborhood discovery algorithm (ENDA), is applied to minimize inter-field intra-field distance of routing planning machines multiple agricultural fields. problem an extended version Agricultural Routing Planning (ARP) that takes into consideration different capacity This also describes mathematical model represent proposed formulated as integer program. experimental results show ENDA successfully solves ARP instances, giving best fastest running compared those obtained by Genetic Algorithms Tabu Search. can save average 11.72% traveled outside working path (when making maneuvers, going or from entrances returning Depot).
منابع مشابه
A Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملA multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks
The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملEvolutionary Algorithm for Drug Discovery [EAfDD]
In essence the program explores the search space by generating random molecules, determining their fitness (based on a variety of criteria) and then breeding a new generation from the fittest individuals. The search space (in theory any combination of any elements in any order) is constrained by the use of a subset of elements (e.g. organic) and a list of fragments (molecular parts that are kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2022
ISSN: ['1572-9338', '0254-5330']
DOI: https://doi.org/10.1007/s10479-022-04685-5